Verification of Nonblockingness in Bounded Petri Nets With Min-Max Basis Reachability Graphs

This article proposes a semi-structural approach to verify the nonblockingness of Petri net. We construct structure, called minimal-maximal basis reachability graph (min-max-BRG): it provides an abstract description set net while preserving all information needed test if is xmlns:xlink="http://www.w3.org/1999/xlink">blocking . prove that bounded deadlock-free xmlns:xlink="http://www.w3.org/1999/xlink">nonblocking and only its min-max-BRG xmlns:xlink="http://www.w3.org/1999/xlink">unobstructed , which can be verified by solving integer constraints then examining min-max-BRG. For nets are not deadlock-free, one needs determine dead markings. done with based on computation xmlns:xlink="http://www.w3.org/1999/xlink">maximal implicit firing sequences enabled markings in The we developed does require construction has wide applicability.